Comparative Performance of FE-FSM, PM-FSM and HE-FSM with Segmental Rotor
نویسندگان
چکیده
منابع مشابه
FSM Partitioning and Synthesis Targeting an Embedded Autonomous FSM
This paper concerns the synthesis of complex finite state machines (FSM) by a novel partitioning and encoding approach. The target architecture is a generalization of FSM implementations with embedded loadable counters. Starting with a subgraph extraction constraints driven partitioning generates three parts, a sequencing, a command and an autonomous logic block. By solving the encoding problem...
متن کاملOn FSM-Based Fault Diagnosis
We study the problem of fault diagnosis, i.e., localization of difference(s) between an implementation and a specification in systems modelled by finite state machines. We show that even considering only a single fault in a finite state machine there are some situations when the exact diagnosis of the fault cannot be assured. We give an algorithm for fault diagnosis. If it is possible the proce...
متن کاملFSM Encoding for BDD Representations
Reduced Ordered Binary Decision Diagrams (ROBDDs or simply BDDs) are a data structure used to efficiently represent and manipulate logic functions. They were introduced by Bryant (1986). Since then, they have played a major role in many areas of computer aided design, including logic synthesis, simulation, and formal verification. The size of a BDD representing a logic function depends on the o...
متن کاملProgressive Solutions to FSM Equations
The equation solving problem is to derive the behavior of the unknown component X knowing the joint behavior of the other components (or the context) C and the specification of the overall system S. The component X can be derived by solving the Finite State Machine (FSM) equation C ◊ X ∼ S, where ◊ is the parallel composition operator and ∼ is the trace equivalence or the trace reduction relati...
متن کاملIncremental methods for FSM traversal
Computing the set of reachablestates of a finite state machine, is an important component of many problems in the synthesis, and formal verification of digital systems. The process of design is usually iterative, and the designer may modify and recompute information many times, and reachability is called each time the designer modifies the system, because current methods for reachability analys...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mechanics and Materials
سال: 2015
ISSN: 1662-7482
DOI: 10.4028/www.scientific.net/amm.773-774.776